A Tableau Calculus for First-Order Branching Time Logic
نویسندگان
چکیده
Tableau based proof systems have been designed for many logics extending classical rst order logic This paper proposes a sound tableau calculus for temporal logics of the rst order CTL family Until now a tableau calculus has only been presented for the propositional version of CTL The calculus considered operates with pre xed formulas and may be regarded as an instance of a labelled deductive system The pre xes allow an explicit partial description of states and paths of a potential Kripke counter model in the tableau It is possible in particular to represent path segments of nite but arbitrary length which are needed to process reachability formulas Furthermore we show that by using pre xed formulas and explicit representation of paths it becomes possible to express and process fairness properties without having to resort to full CTL The approach is suitable for use in interactive proof systems
منابع مشابه
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implementations such as DLP, is due to reduction rules which propagate constraints and prune the search space. Yet, for first order logic such reduction rules are only known for resolution. The lack of reduction rules for fi...
متن کاملA Tableau-Based Theorem Proving Method for Intuitionistic Logic
A new tableau-based calculus for first-order intuitionistic logic is proposed. The calculus is obtained from the tableau calculus for classical logic by extending its rules by A-terms. Aterms are seen as compact representation of natural deduction proofs. The benefits from that approach are two-fold. First, proof search methods known for classical logic can be adopted: Run-time-Skolemization an...
متن کاملTableaux for Quantified Hybrid Logic
We present a (sound and complete) tableau calculus for Quantified Hybrid Logic (QHL). QHL is an extension of orthodox quantified modal logic: as well as the usual 2 and 3 modalities it contains names for (and variables over) states, operators @s for asserting that a formula holds at a named state, and a binder ↓ that binds a variable to the current state. The first-order component contains equa...
متن کاملA Tableau Calculus for a Temporal Logic with Temporal Connectives
The paper presents a tableau calculus for a linear time tem poral logic for reasoning about processes and events in concurrent sys tems The logic is based on temporal connectives in the style of Transac tion Logic BK and explicit quanti cation over states The language extends rst order logic with sequential and parallel conjunction parallel disjunction and temporal implication Explicit quanti c...
متن کامل